#include <iostream>
#include <vector>
#include <unordered_map>

using namespace std;

int w=20,h=21;
vector<vector<int> > points;
vector<vector<int> > k;

int main()
{
    for(int i=0;i<w;i++)
    {
        for(int j=0;j<h;j++)
        {
            vector<int> temp;temp.push_back(i);temp.push_back(j);
            points.push_back(temp);
        }
    }

    for(int i=0;i<points.size();i++)
    {
        for(int j=i+1;j<points.size();j++)
        {
            bool ex = false;
            int x1, y1, x2, y2;
            x1 = points[i][0];y1 = points[i][1];x2 = points[j][0];y2 = points[j][1];
            vector<int> temp;
            temp.push_back(y2-y1);temp.push_back(x2-x1);temp.push_back(x1*temp[0]+y1*temp[1]);
            for(int b=0;b<k.size();b++)
            {
                if(k[b][1]*temp[0] == k[b][0]*temp[1] && x1*k[b][0] + y1*k[b][1] - k[b][2]==0){ex=true;break;}
            }
            if(ex){continue;}
            k.push_back(temp);
        }
    }
    cout<<k.size();
    return 0;
}
